M-Convex Function on Generalized Polymatroid
نویسندگان
چکیده
منابع مشابه
M-Convex Function on Generalized Polymatroid
The concept of M-convex function, introduced recently by Murota, is a quantitative generalization of the set of integral points in an integral base polyhedron as well as an extension of valuated matroid of Dress–Wenzel (1990). In this paper, we extend this concept to functions on generalized polymatroids with a view to providing a unified framework for efficiently solvable nonlinear discrete op...
متن کاملOn generalized Hermite-Hadamard inequality for generalized convex function
In this paper, a new inequality for generalized convex functions which is related to the left side of generalized Hermite-Hadamard type inequality is obtained. Some applications for some generalized special means are also given.
متن کاملM-FUZZIFYING TOPOLOGICAL CONVEX SPACES
The main purpose of this paper is to introduce the compatibility of $M$-fuzzifying topologies and $M$-fuzzifying convexities, define an $M$-fuzzifying topological convex space, and give a method to generate an $M$-fuzzifying topological convex space. Some characterizations of $M$-fuzzifying topological convex spaces are presented. Finally, the notion of $M$-fuzzifying weak topologies is obtaine...
متن کاملOn Convex Generalized Systems
In the paper, the set-convexity and mapping-convexity properties of the extended images of generalized systems are considered. By using these image properties and the tools of topological linear spaces, separation schemes ensuring the impossibility of generalized systems are developed; then, special problem classes are investigated.
متن کاملScaling Algorithms for M - convex Function Minimization
M-convex functions have various desirable properties as convexity in discrete optimization. We can find a global minimum of an M-convex function by a greedy algorithm, i.e., so-called descent algorithms work for the minimization. In this paper, we apply a scaling technique to a greedy algorithm and propose an efficient algorithm for the minimization of an M-convex function. Computational result...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Operations Research
سال: 1999
ISSN: 0364-765X,1526-5471
DOI: 10.1287/moor.24.1.95